Nicola Galesi: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies

Carlucci, Lorenzo, Galesi, Nicola, Lauria, Massimo

Journal:

ACM Transactions on Computational Logic

Year:

2016

Language:

english

File:

PDF, 322 KB

english, 2016

2

[IEEE 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS) - Vienna, Austria (2018.7.2-2018.7.6)] 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS) - Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography

Galesi, Nicola, Ranjbar, Fariba

Year:

2018

Language:

english

File:

PDF, 272 KB

english, 2018

3

Monotone Proofs of the Pigeon Hole Principle

Albert Atserias, Nicola Galesi, Ricard Gavaldà

Journal:

Mathematical Logic Quarterly

Year:

2001

Language:

english

File:

PDF, 218 KB

english, 2001

4

[IEEE 2011 IEEE Annual Conference on Computational Complexity (CCC) - San Jose, CA, USA (2011.06.8-2011.06.11)] 2011 IEEE 26th Annual Conference on Computational Complexity - Paris-Harrington Tautologies

Carlucci, Lorenzo, Galesi, Nicola, Lauria, Massimo

Year:

2011

Language:

english

File:

PDF, 454 KB

english, 2011

5

Optimality of size-degree tradeoffs for polynomial calculus

Galesi, Nicola, Lauria, Massimo

Journal:

ACM Transactions on Computational Logic

Year:

2010

Language:

english

File:

PDF, 212 KB

english, 2010

6

A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games

Olaf Beyersdorff, Nicola Galesi, Massimo Lauria

Journal:

Information Processing Letters

Year:

2010

Language:

english

File:

PDF, 132 KB

english, 2010

7

On the complexity of resolution with bounded conjunctions

Juan Luis Esteban, Nicola Galesi, Jochen Messner

Journal:

Theoretical Computer Science

Year:

2004

Language:

english

File:

PDF, 339 KB

english, 2004

8

Monotone simulations of non-monotone proofs

Albert Atserias, Nicola Galesi, Pavel Pudlák

Journal:

Journal of Computer and System Sciences

Year:

2002

Language:

english

File:

PDF, 173 KB

english, 2002

9

Space complexity of random formulae in resolution

Eli Ben-Sasson, Nicola Galesi

Journal:

Random Structures & Algorithms

Year:

2003

Language:

english

File:

PDF, 158 KB

english, 2003

10

Optimality of size-width tradeoffs for resolution

Maria Luisa Bonet, Nicola Galesi

Journal:

Computational Complexity

Year:

2001

Language:

english

File:

PDF, 212 KB

english, 2001

11

Degree complexity for a modified pigeonhole principle

Maria Luisa Bonet, Nicola Galesi

Journal:

Archive for Mathematical Logic

Year:

2003

Language:

english

File:

PDF, 164 KB

english, 2003

12

On the Automatizability of Polynomial Calculus

Nicola Galesi, Massimo Lauria

Journal:

Theory of Computing Systems

Year:

2010

Language:

english

File:

PDF, 462 KB

english, 2010

13

Parameterized Bounded-Depth Frege Is not Optimal

Beyersdorff, Olaf, Galesi, Nicola, Lauria, Massimo, Razborov, Alexander A.

Journal:

ACM Transactions on Computation Theory

Year:

2012

Language:

english

File:

PDF, 142 KB

english, 2012

14

On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems

Bonet, Maria Luisa, Esteban, Juan Luis, Galesi, Nicola, Johannsen, Jan

Journal:

SIAM Journal on Computing

Year:

2000

Language:

english

File:

PDF, 254 KB

english, 2000

15

A characterization of tree-like Resolution size

Beyersdorff, Olaf, Galesi, Nicola, Lauria, Massimo

Journal:

Information Processing Letters

Year:

2013

Language:

english

File:

PDF, 226 KB

english, 2013

16

Parameterized Complexity of DPLL Search Procedures

Beyersdorff, Olaf, Galesi, Nicola, Lauria, Massimo

Journal:

ACM Transactions on Computational Logic

Year:

2013

Language:

english

File:

PDF, 179 KB

english, 2013

17

[ACM Press the 4th conference - Berkeley, California, USA (2013.01.09-2013.01.12)] Proceedings of the 4th conference on Innovations in Theoretical Computer Science - ITCS '13 - Pseudo-partitions, transversality and locality

Bonacina, Ilario, Galesi, Nicola

Year:

2013

Language:

english

File:

PDF, 576 KB

english, 2013

18

A Framework for Space Complexity in Algebraic Proof Systems

bonacina, Ilario, Galesi, Nicola

Journal:

Journal of the ACM

Year:

2015

Language:

english

File:

PDF, 198 KB

english, 2015

19

[IEEE 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2014.10.18-2014.10.21)] 2014 IEEE 55th Annual Symposium on Foundations of Computer Science - Total Space in Resolution

Bonacina, Ilario, Galesi, Nicola, Thapen, Neil

Year:

2014

Language:

english

File:

PDF, 314 KB

english, 2014

20

Total Space in Resolution

Bonacina, Ilario, Galesi, Nicola, Thapen, Neil

Journal:

SIAM Journal on Computing

Year:

2016

Language:

english

File:

PDF, 392 KB

english, 2016

21

Space proof complexity for random 3-CNFs

Bennett, Patrick, Bonacina, Ilario, Galesi, Nicola, Huynh, Tony, Molloy, Mike, Wollan, Paul

Journal:

Information and Computation

Year:

2017

Language:

english

File:

PDF, 724 KB

english, 2017

22

[IEEE 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) - Baltimore, MD, USA (2019.11.9-2019.11.12)] 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) - Polynomial Calculus Space and Resolution Width

Galesi, Nicola, Kolodziejczyk, Leszek, Thapen, Neil

Year:

2019

Language:

english

File:

PDF, 1.87 MB

english, 2019